Partial Deduction for Structured Logic Programming

In this paper we discuss an extension of Partial Deduction in the framework of structured logic programs. The class of programs we consider includes statically configured systems such as blockand inheritance-based systems, as well as more dynamic configurations which support hypothetical reasoning and viewpoints. We show that the basic Partial Deduction definition can be extended to deal with a richer class of programs while maintaining, under appropriate closedness conditions, the properties of soundness and completeness of the transformation which hold in the case of logic programming.